Clique topology of real symmetric matrices
نویسندگان
چکیده
The purpose of this supplement is to provide a more complete account of the mathematics underlying our analyses in the main text. In particular, the order complex and clique topology are described more precisely here. The order complex of a matrix is analogous to its Jordan Form, in that it captures features that are invariant under a certain type of matrix transformation. Likewise, the clique topology of a matrix is analogous to its eigenvalue spectrum, in that it provides a set of invariants that can be used to detect structure. While the Jordan Form and eigenvalue spectrum are invariant under linear change of variables, the order complex and clique topology are invariant under monotonic transformations of the matrix entries.
منابع مشابه
Spectral Distributions and Isospectral Sets of Tridiagonal Matrices
We analyze the correspondence between finite sequences of finitely supported probability distributions and finite-dimensional, real, symmetric, tridiagonal matrices. In particular, we give an intrinsic description of the topology induced on sequences of distributions by the usual Euclidean structure on matrices. Our results provide an analytical tool with which to study ensembles of tridiagonal...
متن کاملProperties of Central Symmetric X-Form Matrices
In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملRank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract)
Robertson and Seymour prove that a set of graphs of bounded tree-width is wellquasi-ordered by the graph minor relation. By extending their methods to matroids, Geelen, Gerards, and Whittle prove that a set of matroids representable over a fixed finite field are well-quasi-ordered if it has bounded branch-width. More recently, it is shown that a set of graphs of bounded rank-width (or clique-wi...
متن کاملEla Colin De Verdière Parameters of Chordal Graphs
The Colin de Verdière parameters, μ and ν, are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal graphs. For ν the calculation is based solely on maximal cliques, while for μ the calculation depends on split subgraphs. For the case of μ our work extends some recent work on com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015